Edge list multicoloring trees: An extension of Hall's theorem
نویسندگان
چکیده
We prove a necessary and sufficient condition for the existence of edge list multicoloring of trees. The result extends the Halmos – Vaughan generalization of Hall’s theorem on the existence of distinct representatives of sets. ∗Supported by grant OTKA T029074 †On leave from the Computer and Automation Research Institute of the Hungarian Academy of Sciences
منابع مشابه
List edge multicoloring in graphs with few cycles
The list edge multicoloring problem is a version of edge coloring where every edge e has a list of available colors L(e) and an integer demand x(e). For each e, we have to select x(e) colors from L(e) such that adjacent edges receive disjoint sets of colors. Marcotte and Seymour proved a characterization theorem for list edge multicoloring trees, which can be turned into a polynomial time algor...
متن کاملMinimum sum multicoloring on the edges of trees
The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to edge e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The main result of the paper...
متن کاملMinimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-trees (Extended Abstract)
The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to edge e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The main result of the paper...
متن کاملMinimum Sum Multicoloring on the Edges of Trees: (Extended Abstract)
The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to edge e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color assigned to it. The goal is to minimize the sum of the finish times. The main result of the paper...
متن کاملHall's condition yields less for multicolorings
It has been shown that a vertex list assignment satisfying Hall's condition is sufficient for the existence of a proper list coloring if and only if every block of the graph is a clique. It is asked in [5] whether this can be extended to multicolorings. It is shown here that in general this is not the case. Introduction The notion of list coloring has its origins independently with Vizing [7] a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 42 شماره
صفحات -
تاریخ انتشار 2003